Communication-free massively distributed graph generation
نویسندگان
چکیده
منابع مشابه
Communication-free Massively Distributed Graph Generation
Analyzing massive complex networks yields promising insights about our everyday lives. Building scalable algorithms to do that is a challenging task that requires a careful analysis and extensive evaluation. However, engineering such algorithms is often hindered by the scarcity of publicly available datasets. Network generators serve as a tool to alleviate this problem by providing synthetic in...
متن کاملDistributed Graph-Based State Space Generation
LTSMIN provides a framework in which state space generation can be distributed easily over many cores on a single compute node, as well as over multiple compute nodes. The tool works on the basis of a vector representation of the states; the individual cores are assigned the task of computing all successors of states that are sent to them. In this paper we show how this framework can be applied...
متن کاملMassively-Parallel Graph Processing
The goal of this project is to understand the challenges in porting graph algorithms to commodity, hybrid platforms; platforms that consist of processors optimized for sequential processing and accelerators optimized for massively-parallel processing. This study fills the gap between current graph processing platforms that are either expensive (e.g., supercomputers) or inefficient (e.g., commod...
متن کاملCommunication Complexity of Approximate Maximum Matching in Distributed Graph Data
We consider the problem of computing an approximate maximum matching in a graph that consists of n vertices whose edges are stored across k distributed sites in a data center. We are interested in characterizing the communication complexity of this problem which is of primary concern in data centers where communication bandwidth is a scarce resource. Our main result is that any algorithm that f...
متن کاملParallel Graph Generation Algorithms for Shared and Distributed Memory Machines
In this paper we give an overview and a comparison of two parallel algorithms for the state space generation in stochastic modeling on common classes of multiprocessors In this context state space generation simply means constructing a graph which usually gets extremely large On shared memory machines the key problem for a parallelization is the implementation of a shared data structure which e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Parallel and Distributed Computing
سال: 2019
ISSN: 0743-7315
DOI: 10.1016/j.jpdc.2019.03.011